Priority queueing system with many types of requests and restricted processor sharing

Modelling Restricted Processor Sharing

In principle unrestricted processor sharing can be very useful when jobs with widely varying CPU requirements are competing for the same processor. Even if there are several processors available, processor sharing can be useful. However, in practice it must be implemented by round-robin, and there is an overhead cost (e.g., cache thrashing) to implementing this scheme. Furthermore, the overhead...

/N/∞ Queueing System with Absolute Priority and Reservation of Servers

1 School of Economics and Management, Inner Mongolia University of Science and Technology, 014010 Baotou, China 2 Inner Mongolia Industry Informatization and Innovation Research Center, Inner Mongolia University of Science and Technology, 014010 Baotou, China 3 Institute of Information and Communication, Chonbuk National University, Jeonju 561-765, Republic of Korea 4Department of Applied Mathe...

Stability of a priority queueing system with customer transfers

Queueing with redundant requests: exact analysis

Recent computer systems research has proposed using redundant requests to reduce latency. The idea is to run a request on multiple servers and wait for the first completion (discarding all remaining copies of the request). However, there is no exact analysis of systems with redundancy. This paper presents the first exact analysis of systems with redundancy. We allow for any number of classes of...

Two-Class Priority Queueing System with State-Dependent Arrivals

In this paper, we present a performance analysis of a 2-dimensional preemptive priority queueing system with state-dependent arrivals. Using a Markovian formulation we first compute the steady state distribution for the queue length of both classes. Then, waiting times and busy periods are characterized through (i) first and second moments and (ii) the approximation of their cumulative distribu...